Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications

نویسندگان

  • Alejandro H. Morales
  • Igor Pak
  • Greta Panova
چکیده

The Naruse hook-length formula is a recent general formula for the number of standard Young tableaux of skew shapes, given as a positive sum over excited diagrams of products of hook-lengths. In [MPP1] we gave two different q-analogues of Naruse’s formula: for the skew Schur functions, and for counting reverse plane partitions of skew shapes. In this paper we give an elementary proof of Naruse’s formula based on the case of border strips. For special border strips, we obtain curious new formulas for the Euler and q-Euler numbers in terms of certain Dyck path summations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hook Formulas for Skew Shapes

The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a positive sum over excited diagrams of products of hook-lengths. We give an algebraic and a combinatorial proof of Naruse’s formula, by using factorial Schur functio...

متن کامل

Combinatorial applications of symmetric function theory to certain classes of permutations and truncated tableaux

The purpose of this dissertation is to study certain classes of permutations and plane partitions of truncated shapes. We establish some of their enumerative and combinatorial properties. The proofs develop methods and interpretations within various fields of algebraic combinatorics, most notably the theory of symmetric functions and their combinatorial properties. The first chapter of this the...

متن کامل

Combinatorial Proofs of Hook Generating Functions for Skew Plane Partitions

Sagan, B.E., Combinatorial proofs of hook generating functions for skew plane partitions, Theoretical Computer Science 117 (1993) 273-287. We provide combinatorial proofs of two hook generating functions for skew plane partitions. One proof involves the Hillman-Grass1 (1976) algorithm and the other uses a modification of Schiitzenberger’s (1963, 1977) “jeu de taquin” due to Kadell (to appear). ...

متن کامل

Hook formulas for skew shapes I. q-analogues and bijections

The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a positive sum over excited diagrams of products of hook-lengths. We give an algebraic and a combinatorial proof of Naruse’s formula, by using factorial Schur functio...

متن کامل

On Han's Hook Length Formulas for Trees

Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han’s formulas has been generalized to k-ary trees by Yang. Sagan has found a probabilistic proof of Yang’s extension. We give combinatorial proofs of Yang’s formula for k-ary trees and the other formula of Han for binary trees. Our bijections are based on the structure of k-ary trees ass...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2017